Data Dp Rand Frag Data 1 Data 2 Rmsd Len Time Rmsd Len Time Rmsd Len Time
نویسندگان
چکیده
This paper proposes new algorithms for protein structure alignment. Protein structure alignment is, given two three-dimensional protein structures, to nd spatially equivalent residue pairs. Each algorithm consists of the following two steps: rst an initial superposition is computed; then a structure alignment is computed and re ned using bipartite graph matching. The proposed algorithms are shown to be useful through an experimental comparison with a previous alignment algorithm.
منابع مشابه
Rmsd Len Time Rmsd Len Time Rmsd Len Time
This paper proposes new algorithms for protein structure alignment. Protein structure alignment is, given two three-dimensional protein structures, to nd spatially equivalent residue pairs. Each algorithm consists of the following two steps: rst an initial superposition is computed; then a structure alignment is computed and re ned using bipartite graph matching. The proposed algorithms are sho...
متن کاملEfficient Substructure RMSD Query Algorithms
Protein structure analysis is a very important research topic in the molecular biology of the post-genomic era. The root mean square deviation (RMSD) is the most frequently used measure for comparing two protein three-dimensional (3-D) structures. In this paper, we deal with two fundamental problems related to the RMSD. We first deal with a problem called the "range RMSD query" problem. Given a...
متن کاملThe Weighted All-Pairs-Shortest-Path-Length Problem on Two-Terminal Series-Parallel Graphs
Let G(V, E) be a n-vertex graph with V = { , ..., } and each edge e = ( , ) is associated with two real weights, W( → ) and W( → ). Let P be a path from any source vertex s to any destination vertex d and assume that P is s = → → ... → = d, t ≥ 2. The length of P, denoted by Len(P), is defined as ∑ . Given any two distinct vertices s and d, the length from s to d is defined as Len(s ⇒ d) = min{...
متن کاملApplication of sparse NMR restraints to large-scale protein structure prediction.
The protein structure prediction algorithm TOUCHSTONEX that uses sparse distance restraints derived from NMR nuclear Overhauser enhancement (NOE) data to predict protein structures at low-to-medium resolution was evaluated as follows: First, a representative benchmark set of the Protein Data Bank library consisting of 1365 proteins up to 200 residues was employed. Using N/8 simulated long-range...
متن کاملHigh b-value q-space diffusion MRS of nerves: structural information and comparison with histological evidence.
High b-value q-space diffusion MRS was used to study the diffusion characteristics of formalin-fixed swine optic and sciatic nerves over a large range of diffusion times (3.7-99.3 ms). The very short diffusion time range was studied with a 1 ms resolution. The displacement distribution profiles obtained were fitted to a bi-Gaussian function, and structural parameters were extracted from the q-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995